Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
نویسندگان
چکیده
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first receipt-free scheme to give “everlasting privacy” for votes: even a computationally unbounded party does not gain any information about individual votes (other than what can be inferred from the
منابع مشابه
Election Verifiability or Ballot Privacy: Do We Need to Choose?
We propose a new encryption primitive, commitment consistent encryption (CCE), and instances of this primitive that enable building the first universally verifiable voting schemes with a perfectly private audit trail (PPAT) and practical complexity. That is: – the audit trail that is published for verifying elections guarantees everlasting privacy, and – the computational load required from the...
متن کاملReceipt Freeness of Prêt à Voter Provably Secure
Prêt à Voter is an end-to-end verifiable voting scheme that is also receipt free. Formal method analysis was used to prove that Prêt à Voter is receipt free. In this paper we use one of the latest versions of Prêt à Voter [XCH10] to prove receipt freeness of the scheme using computational methods. We use provable security game models for the first time to prove a paper based voting scheme recei...
متن کاملThreat Analysis of a Practical Voting Scheme with Receipts
Kutylowski et al. have introduced a voter-verifiable electronic voting scheme ”a practical voting scheme with receipts”, which provides each voter with a receipt. The voter can use her receipt to check whether her vote has been properly counted in the final tally, but she cannot use the receipt to prove others how she has voted. Another interesting property of this scheme is that, thanks to the...
متن کاملSome remarks on a receipt - free and universallyveri able Mix - type voting
At Eurocrypt'95 Sako and Kilian presented the rst Mix-type voting scheme which is receipt-free and universally veriiable. In this contribution we analyze this scheme and show that the coercer must not collude with any center. Otherwise its robustness is lost. As a result, the assumed coercer model is clariied. More seriously, it is further pointed out that the privacy of votes can't be guarante...
متن کاملUniversally Verifiable Efficient Re-encryption Mixnet
Implementing a transparent audit process when an election is conducted by electronic means is of paramount importance. Universally verifiable mixnets are focused on providing such a property by means of cryptographic proofs verifiable by any auditor. While some of these systems require high amount of computing resources that make them inefficient for real elections, others proposals reduce the ...
متن کامل